Interactive Theorem Proving with Tasks
نویسندگان
چکیده
Interactive theorem proving systems for mathematics require user interfaces which allow for user interaction that is as natural as possible. However, this interaction is often limited by the traditional calculi underlying most theorem proving systems. This is particularly problematic with respect to the application of assertions and intuitive presentation of proof states. In this paper we show how a more flexible user interaction can be realized when traditional calculi for classical logic are replaced by a less restrictive reasoning engine, the recently developed CORE [2] system. We describe the task level which is built on top of the CORE system and combines the Proof by Pointing approach [5] with a flexible mechanism for the application of assertions that avoids decomposition and abstracts from the syntactical form of an assertion. We demonstrate how proof steps that are difficult to implement in other systems, like forward application of assertions, are quite naturally supported by the underlying CORE system and are therefore straightforward to realize at the task level.
منابع مشابه
BCS Interaction for Declarative Theorem Proving
This article is concerned with interactive support for \declarative theorem proving". After introducing declarative theorem proving, both in general and as implemented in the Declare system, we outline the requirements of an interactive system in this context. We describe Ideclare, the interactive environment for Declare, and in particular its support for visualisation, logical navigation and d...
متن کاملInteraction for Declarative Theorem Proving
This article is concerned with interactive support for \declarative theorem prov-ing". After introducing declarative theorem proving, both in general and as implemented in the Declare system, we outline the requirements of an interactive system in this context. We describe Ideclare, the interactive environment for Declare, and in particular its support for visualisation, logical navigation and ...
متن کاملStructure in Hardware Proofs: First Steps Towards Automation in a Higher-Order Environment
Most proofs of hardware in an higher-order logic environment follow a definite pattern. This observation is used to give a methodology for hardware proofs in order to isolate the situations where the designer’s creativity is required, and to automate the remaining tedious proof tasks. The interactive HOL theorem prover has been extended by generalized hardware specific tactics for simplifying p...
متن کاملIntegrating Automated and Interactive Theorem Proving
This paper highlights a project to integrate interactive and automated theorem proving in Software Veriication. Its aim is to combine the advantages of the two paradigms. We report on the integration concepts, and on the experimental results with a prototype implementation .
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 103 شماره
صفحات -
تاریخ انتشار 2004